Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems
نویسندگان
چکیده
منابع مشابه
Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems
Given a graph G we provide dynamic programming algorithms for many locally checkable vertex subset and vertex partitioning problems. Their runtime is polynomial in the number of equivalence classes of problem-specific equivalence relations on subsets of vertices, defined on a given decomposition tree of G. Using these algorithms all these problems become solvable in polynomial time for many wel...
متن کاملFast algorithms for vertex subset and vertex partitioning problems on graphs of low boolean-width⋆
We consider the graph parameter boolean-width, related to the number of different unions of neighborhoods across a cut of a graph. Boolean-width is similar to rankwidth, which is related to the number of GF [2]-sums (1+1=0) of neighborhoods instead of the Boolean-sums (1+1=1) used for boolean-width. It compares well to the other four well-known width parameters tree-width, branch-width, clique-...
متن کاملAlgorithms for vertex subset and vertex partitioning problems with runtime single exponential in rankwidth
Let σ and ρ be finite or co-finite subsets of natural numbers. A subset of vertices S of a graph G = (V,E) is a (σ, ρ) -set of G if ∀v ∈ V : |N(v) ∩ S| ∈ σ if v ∈ S ρ if v ∈ V \ S A degree constraint matrix Dq is a q by q matrix with entries being finite or co-finite subsets of natural numbers. A Dq -partition in a graph G = (V,E) is a partition V1, V2, ..., Vq of V such that for 1 ≤ i, j ≤ q...
متن کاملAlgorithms for Vertex Partitioning Problems on Partial k-Trees
In this paper, we consider a large class of vertex partitioning problems and apply to them the theory of algorithm design for problems restricted to partial k-trees. We carefully describe the details of algorithms and analyze their complexity in an attempt to make the algorithms feasible as solutions for practical applications. We give a precise characterization of vertex partitioning problems,...
متن کاملFaster algorithms for vertex partitioning problems parameterized by clique-width
Many NP-hard problems, such as Dominating Set, are FPT parameterized by clique-width. For graphs of clique-width k given with a kexpression, Dominating Set can be solved in 4knO(1) time. However, no FPT algorithm is known for computing an optimal k-expression. For a graph of clique-width k, if we rely on known algorithms to compute a (23k − 1)expression via rank-width and then solving Dominatin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2013
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2013.01.009